Arithmetic Coding- A Reliable Implementation
نویسندگان
چکیده
منابع مشابه
Arithmetic Coding
• Arithmetic Coding is universal • Arithmetic coding is suitable for small alphabet (binary sources) with highly skewed probabilities. • Huffman cannot allocate fractional bits to symbols: , but the algorithm will assign 1 bit. Huffman needs at least one bit per symbol. If, however, the alphabet is large and probabilities are not skewed, Huffman rate is pretty close to entropy (H). , 01 . 0 , 9...
متن کاملReliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملTowards a Fast and Reliable Software Implementation of SLI-FLP Hybrid Computer Arithmetic
In this paper we describe a C++ implementation of a hybrid system combining SLI (symmetric level-index) arithmetic and FLP (floating-point) arithmetic. The principal motivation for the work to be presented is to promote the use of SLI arithmetic as a practical framework for scientific computing. This hybrid arithmetic is essentially overflow and underflow free, and its implementation has shown ...
متن کاملReliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملP-adic arithmetic coding
A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12750-9688